Minimal Relative Normalization in Orthogonal Expression Reduction Systems

نویسندگان

  • John R. W. Glauert
  • Zurab Khasidashvili
چکیده

? Abstract. In previous papers, the authors studied normalization relative to desirable sets S of`partial results', where it is shown that such sets must be stable. For example, the sets of normal forms, head-normal-forms, and weak head-normal-forms in the-calculus, are all stable. They showed that, for any stable S, S-needed reductions are S-normalizing. This paper continues the investigation into the theory of relative normalization. In particular, we prove existence of minimal normalizing reductions for regular stable sets of results. All the above mentioned sets are regular. We give a suucient and necessary criterion for a normalizing reduction (w.r.t. a regular stable S) to be minimal. Finally, we establish a relationship between relative minimal and optimal reductions, revealing a connict between minimality and optimality: for regular stable sets of results, a term need not possess a reduction that is minimal and optimal at the same time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perpetuality and Uniform Normalization

We de ne a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. L evy's ordering on reductions) in nite reductions in Conditional Orthogonal Expression Reduction Systems. We use this strategy to derive two characterizations of perpetual redexes, i.e., redexes whose contractions retain the existence of in nite reductions. These characterizations generalize existin...

متن کامل

Relative Normalization in Orthogonal Expression Reduction Systems

We study reductions in orthogonal (left-linear and non-ambiguous) Expression Reduction Systems, a formalism for Term Rewriting Systems with bound variables and substitutions. To generalise the normalization theory of Huet and Lévy, we introduce the notion of with respect to a set of reductions or a set of terms so that each existing notion of neededness can be given by specifying or . We impose...

متن کامل

Normalization of qPCR array data: a novel method based on procrustes superimposition

MicroRNAs (miRNAs) are short, endogenous non-coding RNAs that function as guide molecules to regulate transcription of their target messenger RNAs. Several methods including low-density qPCR arrays are being increasingly used to profile the expression of these molecules in a variety of different biological conditions. Reliable analysis of expression profiles demands removal of technical variati...

متن کامل

Vicious Circles in Orthogonal Term Rewriting Systems

In this paper we first study the difference between Weak Normalization (WN) and Strong Normalization (SN), in the framework of first order orthogonal rewriting systems. With the help of the Erasure Lemma we establish a Pumping Lemma, yielding information about exceptional terms, defined as terms that are WN but not SN. A corollary is that if an orthogonal TRS is WN, there are no cyclic reductio...

متن کامل

Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems

We present two characterizations of perpetual redexes, which are redexes whose contractions retain the possibility of in nite reductions. These characterizations generalize and strengthen existing criteria for the perpetuality of redexes in orthogonal Term Rewriting Systems and the -calculus due to Bergstra and Klop, and others. To unify our results with those in the literature, we introduce Co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996